Sets with No Solutions

نویسنده

  • Yahya Ould Hamidoune
چکیده

This short note gives an upper bound on the measure of sets A ⊂ [0, 1] such that x+ y = 3z has no solutions in A. To the memory of Yahya Ould Hamidoune.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New Iterative Algorithm for Multivalued Nonexpansive Mappping and Equlibruim Problems with Applications

In this paper, we introduce two iterative schemes by a modified Krasnoselskii-Mann algorithm for finding a common element of the set of solutions of equilibrium problems and the set of fixed points of multivalued nonexpansive mappings in Hilbert space. We prove that the sequence generated by the proposed method converges strongly to a common element of the set of solutions of equilibruim proble...

متن کامل

The approximate solutions of Fredholm integral equations on Cantor sets within local fractional operators

In this paper, we apply the local fractional Adomian decomposition and variational iteration methods to obtain the analytic approximate solutions of Fredholm integral equations of the second kind within local fractional derivative operators. The iteration procedure is based on local fractional derivative. The obtained results reveal that the proposed methods are very efficient and simple tools ...

متن کامل

An interval-valued programming approach to matrix games with payoffs of triangular intuitionistic fuzzy numbers

The purpose of this paper is to develop a methodology for solving a new type of matrix games in which payoffs are expressed with triangular intuitionistic fuzzy numbers (TIFNs). In this methodology, the concept of solutions for matrix games with payoffs of TIFNs is introduced. A pair of auxiliary intuitionistic fuzzy programming models for players are established to determine optimal strategies...

متن کامل

Computing Minimal Hitting Sets with Genetic Algorithm

A set S that has a non-empty intersection with every set in a collection of sets C is called a hitting set of C. If no element can be removed from S without violating the hitting set property, S is considered to be minimal. Several interesting problems can be partly formulated as ones that a minimal hitting set or more ones have to be found. Many of these problems are required for proper soluti...

متن کامل

Probabilistic Linkage of Persian Record with Missing Data

Extended Abstract. When the comprehensive information about a topic is scattered among two or more data sets, using only one of those data sets would lead to information loss available in other data sets. Hence, it is necessary to integrate scattered information to a comprehensive unique data set. On the other hand, sometimes we are interested in recognition of duplications in a data set. The i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012